Nearest Neighbors in High-Dimensional Spaces
نویسنده
چکیده
منابع مشابه
Quantitative Analysis of Nearest-Neighbors Search in High-Dimensional Sampling-Based Motion Planning
We quantitatively analyze the performance of exact and approximate nearest-neighbors algorithms on increasingly high-dimensional problems in the context of sampling-based motion planning. We study the impact of the dimension, number of samples, distance metrics, and sampling schemes on the efficiency and accuracy of nearest-neighbors algorithms. Efficiency measures computation time and accuracy...
متن کاملFeatures of Nearest Neighbors Distances in High-Dimensional Space
Methods of nearest neighbors are essential in wide range of applications where it is necessary to estimate probability density (e.g. Bayes’s classifier, problems of searching in large databases). This paper contemplates on features of distribution of nearest neighbors’ distances in high-dimensional spaces. It shows that for uniform distribution of points in n-dimensional Euclidean space the dis...
متن کاملClassification of Chronic Kidney Disease Patients via k-important Neighbors in High Dimensional Metabolomics Dataset
Background: Chronic kidney disease (CKD), characterized by progressive loss of renal function, is becoming a growing problem in the general population. New analytical technologies such as “omics”-based approaches, including metabolomics, provide a useful platform for biomarker discovery and improvement of CKD management. In metabolomics studies, not only prediction accuracy is ...
متن کاملNonlinear Dimensionality Reduction using Approximate Nearest Neighbors
Nonlinear dimensionality reduction methods often rely on the nearest-neighbors graph to extract low-dimensional embeddings that reliably capture the underlying structure of high-dimensional data. Research however has shown that computing nearest neighbors of a point from a highdimensional data set generally requires time proportional to the size of the data set itself, rendering the computation...
متن کاملHigh-Dimensional Similarity Search Using Data-Sensitive Space Partitioning
Nearest neighbor search has a wide variety of applications. Unfortunately, the majority of search methods do not scale well with dimensionality. Recent efforts have been focused on finding better approximate solutions that improve the locality of data using dimensionality reduction. However, it is possible to preserve the locality of data and find exact nearest neighbors in high dimensions with...
متن کامل